Depth range reduction for 3D range geometry compression

نویسندگان

چکیده

Three-dimensional (3D) shape measurement devices and techniques are being rapidly adopted within a variety of industries applications. As acquiring 3D range data becomes faster more accurate it challenging to efficiently store, transmit, or stream this data. One prevailing approach compressing is encode the color channels regular 2D images. This paper presents novel method for reducing depth geometry such that can be stored image using lower encoding frequencies (or fewer number periods). allows smaller compressed file sizes achieved without proportional increase in reconstruction errors. Further, as proposed occurs prior encoding, readily compatible with existing image-based compression methods.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiwavelength depth encoding method for 3D range geometry compression.

This paper presents a novel method for representing three-dimensional (3D) range data within regular two-dimensional (2D) images using multiwavelength encoding. These 2D images can then be further compressed using traditional lossless (e.g., PNG) or lossy (e.g., JPEG) image compression techniques. Current 3D range data compression methods require significant filtering to reduce lossy compressio...

متن کامل

Computing 3D Geometry Directly from Range Images

Several techniques have been developed in research and industry for computing 3D geometry from sets of aligned range images. Recent work has shown that volumetric methods are robust to scanner noise and alignment uncertainty and provide good quality, watertight models. However, these methods suffer from limited resolution, large memory requirements and long processing times, and they produce ex...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Illumination technique for optical dynamic range compression and offset reduction

This paper presents a novel illumination technique for image processing in environments which are characterized by large intensity fluctuations and hence a high optical dynamic range (HDR). This proposal shows how by combining a set of images, flashed with different radiant intensities but with a constant exposure time for the imager, a single image can be produced with a compressed dynamic ran...

متن کامل

Extending the Radar Dynamic Range using Adaptive Pulse Compression

The matched filter in the radar receiver is only adapted to the transmitted signal version and its output will be wasted due to non-matching with the received signal from the environment. The sidelobes amplitude of the matched filter output in pulse compression radars are dependent on the transmitted coded waveforms that extended as much as the length of the code on both sides of the target loc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Optics and Lasers in Engineering

سال: 2021

ISSN: ['1873-0302', '0143-8166']

DOI: https://doi.org/10.1016/j.optlaseng.2020.106457